A completely unique account of enumeration

How can we enumerate the inhabitants of an algebraic datatype? This paper explores a datatype generic solution that works for all regular types and indexed families . The enumerators presented here are provably both complete unique —they will eventually produce every value exactly once—and fair avoid bias when composing enumerators. Finally, these memoise previously enumerated values whenever possible, thereby avoiding repeatedly recomputing recursive results.